Changing domination in fuzzy graph

Total Strong (Weak) Domination Intuitionistic Fuzzy Graph

Changing and unchanging of the domination number of a graph

LetG be a graph and (G) denote the domination number ofG. A dominating setD of a graphGwith |D|= (G) is called a -set ofG. A vertex x of a graphG is called: (i) -fixed if x belongs to every -set, (ii) -free if x belongs to some -set but not to all -sets, (iii) -bad if x belongs to no -set, (iv) −-free if x is -free and (G− x)= (G)− 1, (v) 0-free if x is -free and (G− x)= (G), and (vi) q -fixed ...

Total Semi - μ Strong (Weak) Domination in Intuitionistic Fuzzy Graph

In the initial stage we proposed the concept of Total Strong (Weak) domination in Fuzzy graph. It deal with the real time application that helps a individual person in crossing a road traffic signal. We will be giving a single value for vertices and edges. Enhancing the same concept, the Total Strong (Weak) domination in Intuitionistic Fuzzy graph was proposed. Here we will be giving a double v...

Total strong (weak) domination in bipolar fuzzy graph

In this paper, the new kind of parameter strong (weak) domination number in a bipolar fuzzy graph is defined and established the parametric conditions. Another new kind of parameter a totalstrong (weak) bipolar domination number is defined and established the parametric conditions. The properties of strong (weak) bipolar domination number and totalstrong (weak) bipolar domination numbersare dis...

Complementary Nil Domination in Interval- valued Intuitionistic Fuzzy Graph